Estimating landscape carrying capacity through maximum clique analysis.

نویسندگان

  • Therese M Donovan
  • Gregory S Warrington
  • W Scott Schwenk
  • Jeffrey H Dinitz
چکیده

Habitat suitability (HS) maps are widely used tools in wildlife science and establish a link between wildlife populations and landscape pattern. Although HS maps spatially depict the distribution of optimal resources for a species, they do not reveal the population size a landscape is capable of supporting--information that is often crucial for decision makers and managers. We used a new approach, "maximum clique analysis," to demonstrate how HS maps for territorial species can be used to estimate the carrying capacity, N(k), of a given landscape. We estimated the N(k) of Ovenbirds (Seiurus aurocapillus) and bobcats (Lynx rufus) in an 1153-km2 study area in Vermont, USA. These two species were selected to highlight different approaches in building an HS map as well as computational challenges that can arise in a maximum clique analysis. We derived 30-m2 HS maps for each species via occupancy modeling (Ovenbird) and by resource utilization modeling (bobcats). For each species, we then identified all pixel locations on the map (points) that had sufficient resources in the surrounding area to maintain a home range (termed a "pseudo-home range"). These locations were converted to a mathematical graph, where any two points were linked if two pseudo-home ranges could exist on the landscape without violating territory boundaries. We used the program Cliquer to find the maximum clique of each graph. The resulting estimates of N(k) = 236 Ovenbirds and N(k) = 42 female bobcats were sensitive to different assumptions and model inputs. Estimates of N(k) via alternative, ad hoc methods were 1.4 to > 30 times greater than the maximum clique estimate, suggesting that the alternative results may be upwardly biased. The maximum clique analysis was computationally intensive but could handle problems with < 1500 total pseudo-home ranges (points). Given present computational constraints, it is best suited for species that occur in clustered distributions (where the problem can be broken into several, smaller problems), or for species with large home ranges relative to grid scale where resampling the points to a coarser resolution can reduce the problem to manageable proportions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimating the carrying capacity of tourism and the necessity of forest stands management (Case study: Darkeshforest, North Khorasan, Iran)

This study focuses on the carrying capacity estimation for Darkesh forest in Northeast Iran. Four factors were used for estimating the carrying capacity including tourist flows, size of the area, optimum space available for each tourist, and visiting time. Results showed that the physical carrying capacity was 2727 ha or 165 visitors/day, while the real carrying capacity was 2719 ha or 132 visi...

متن کامل

Cover-Encodings of Fitness Landscapes

An instance of a discrete optimization problem can be tackled by a local search on a suitably defined cost or fitness landscape. Ruggedness of the landscape arrests the search or slows down its progress due to trapping in local minima. Alternatively, a heuristic approximation may be used for estimating a global cost minimum. Here we present a combination of these two approaches by cover-encodin...

متن کامل

Optimal Trajectory of Flexible Manipulator with Maximum Load Carrying Capacity

In this paper, a new formulation along with numerical solution for the problem of finding a point-to-point trajectory with maximum load carrying capacities for flexible manipulators is proposed. For rigid manipulators, the major limiting factor in determining the Dynamic Load Carrying Capacity (DLCC) is the joint actuator capacity. The flexibility exhibited by light weight robots or by robots o...

متن کامل

Breakout Local Search for maximum clique problems

The maximum clique problem (MCP) is one of the most popular combinatorial optimization problems with various practical applications. An important generalization of MCP is the maximum weight clique problem (MWCP) where a positive weight is associate to each vertex. In this paper, we present Breakout Local Search (BLS) which can be applied to both MC and MWC problems without any particular adapta...

متن کامل

Evaluating total carrying capacity of tourism using impact indicators

The carrying capacity is well identified tool to manage problems due to uncontrolled tourism for any destination. This report highlights the carrying capacity estimation of Kerwa tourism area, Bhopal, India. The methodology used in this report is a new two-tier mechanism of impact analysis using index numbers derived from a survey of 123 stakeholders. From this the individual component impact a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Ecological applications : a publication of the Ecological Society of America

دوره 22 8  شماره 

صفحات  -

تاریخ انتشار 2012